Lightweight and Side-channel Secure 4 × 4 S-Boxes from Cellular Automata Rules
نویسندگان
چکیده
منابع مشابه
Cellular Automata Based S-boxes
Cellular Automata (CA) represent an interesting approach to design Substitution Boxes (S-boxes) having good cryptographic properties and low implementation costs. From the cryptographic perspective, up to now there have been only ad-hoc studies about specific kinds of CA, the best known example being the χ nonlinear transformation used in Keccak. In this paper, we undertake a systematic investi...
متن کاملOptimality and beyond: The case of 4×4 S-boxes
S-boxes with better transparency order are expected to have higher side-channel resistance. For 8×8 Sboxes this is not practical, considering the costs of lookuptable implementations and deterioration of many properties like nonlinearity or delta uniformity. However, if we concentrate on the 4×4 S-box size we can observe that it is possible to obtain S-boxes with better transparency order while...
متن کاملCryptographic Analysis of All 4 × 4-Bit S-Boxes
We present cryptanalytic results of an exhaustive search of all 16! bijective 4-bit S-Boxes. Previously affine equivalence classes have been exhaustively analyzed in 2007 work by Leander and Poschmann. We extend on this work by giving further properties of the optimal S-Box linear equivalence classes. In our main analysis we consider two S-Boxes to be cryptanalytically equivalent if they are is...
متن کاملWhat do S-boxes Say in Differential Side Channel Attacks?
Cryptographic devices are vulnerable against the now wellknown side channel leakage analysis. Secret data, such as keys, can be revealed by attacks like DPA, DEMA, CPA. However, this kind of attacks also exhibits wrong keys, this phenomenon being known as the ”ghost peaks” problem and has been briefly explained in CPA. We give here a comprehension and analysis of the ghost peak problem that occ...
متن کاملOn weakly APN functions and 4-bit S-Boxes
S-Boxes are important security components of block ciphers. We provide theoretical results on necessary or sufficient criteria for an (invertible) 4-bit S-Box to be weakly APN. Thanks to a classification of 4-bit invertible S-Boxes achieved independently by De Canniére and Leander-Poschmann, we can strengthen our results with a computeraided proof. We also propose a class of 4-bit S-Boxes which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR Transactions on Symmetric Cryptology
سال: 2018
ISSN: 2519-173X
DOI: 10.46586/tosc.v2018.i3.311-334